Theory of 2-3 Heaps
نویسنده
چکیده
As an alternative to the Fibonacci heap, we design a new data structure called a 2-3 heap, which supports m decrease-key, and n insert operations and delete-min operations in O(m + n log n) time. The merit of the 2-3 heap is that it is conceptually simpler and easier to implement. The new data structure will have a wide application in
منابع مشابه
Relaxed Fibonacci heaps : An alternative to Fibonacci heaps with worst case rather than amortized time bounds ∗ Chandrasekhar
We present a new data structure called relaxed Fibonacci heaps for implementing priority queues on a RAM. Relaxed Fibonacci heaps support the operations find minimum, insert, decrease key and meld, each in O(1) worst case time and delete and delete min in O(log n) worst case time. Introduction The implementation of priority queues is a classical problem in data structures. Priority queues find ...
متن کاملHeap building bounds
We have considered the uppper and lower bounds for building heaps in the worst and average cases. Heaps are binary tree for which all its levels are full except the last one. The nodes on the last level are all as much to the left as possible. A max-heap has the property that every node has value greater or equal to that of its children. We have studied the contruction of heaps in the compariso...
متن کاملA New Heap Game
Given k ≥ 3 heaps of tokens. The moves of the 2-player game introduced here are to either take a positive number of tokens from at most k − 1 heaps, or to remove the same positive number of tokens from all the k heaps. We analyse this extension of Wythoff’s game and provide a polynomial-time strategy for it.
متن کاملOn rank functions for heaps
Motivated by work of Stembridge, we study rank functions for Viennot’s heaps of pieces. We produce a simple and sufficient criterion for a heap to be a ranked poset and apply the results to the heaps arising from fully commutative words in Coxeter groups. To appear in the Journal of Combinatorial Theory, Series A
متن کاملPerformance in Supervisory Control Theory
A supervisor is generated with Supervisory Control Theory [3], resulting in a nonblocking and minimally restrictive controller. Time is introduced time using timed automata theory. A compact data structure is used to keep track of the time information in the timed automata: Heaps of Pieces [2]. The fastest sequence of events is found, using graph search algorithms of Dijkstra and A [1]. This is...
متن کامل